翻訳と辞書 Words near each other ・ Red (2010 film) ・ Red (an orchestra) ・ Red (audio drama) ・ Red (band) ・ Red (Black Uhuru album) ・ Recursive ordinal ・ Recursive partitioning ・ Recursive recycling ・ Recursive science fiction ・ Recursive self-improvement ・ Recursive set ・ Recursive transition network ・ Recursive tree ・ Recursive wave ・ Recursive XY-cut ・ Recursively enumerable language ・ Recursively enumerable set ・ Recursively inseparable sets ・ Recurso de amparo ・ Recursolândia ・ Recurt ・ Recurva ・ Recurvaria ・ Recurvaria annulicornis ・ Recurvaria cinerella ・ Recurvaria comprobata ・ Recurvaria consimilis ・ Recurvaria costimaculella ・ Recurvaria dryozona ・ Recurvaria eromene Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Recursively enumerable language ： ウィキペディア英語版 Recursively enumerable language In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e., if there exists a Turing machine which will enumerate all valid strings of the language. Recursively enumerable languages are known as type-0 languages in the Chomsky hierarchy of formal languages. All regular, context-free, context-sensitive and recursive languages are recursively enumerable. The class of all recursively enumerable languages is called RE. ==Definitions== There exist three equivalent major definitions for the concept of a recursively enumerable language. # A recursively enumerable language is a recursively enumerable subset in the set of all possible words over the alphabet of the language. # A recursively enumerable language is a formal language for which there exists a Turing machine (or other computable function) which will enumerate all valid strings of the language. Note that if the language is infinite, the enumerating algorithm provided can be chosen so that it avoids repetitions, since we can test whether the string produced for number ''n'' is "already" produced for a number which is less than ''n''. If it already is produced, use the output for input ''n+1'' instead (recursively), but again, test whether it is "new". # A recursively enumerable language is a formal language for which there exists a Turing machine (or other computable function) that will halt and accept when presented with any string in the language as input but may either halt and reject or loop forever when presented with a string not in the language. Contrast this to recursive languages, which require that the Turing machine halts in all cases. All regular, context-free, context-sensitive and recursive languages are recursively enumerable. Post's theorem shows that RE, together with its complement co-RE, correspond to the first level of the arithmetical hierarchy. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Recursively enumerable language」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.